Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
نویسندگان
چکیده
منابع مشابه
Fully dynamic maximal matching in O(log n) update time : with revised and corrected analysis
Baswana, Gupta and Sen [1] had presented a fully dynamic algorithm for maximal matching which achieved O(log n) expected amortized time per edge insertion or deletion. Moreover, for any sequence of t edge updates, the total time taken by the algorithm is O(t log n + n log n) with high probability. Unfortunately, the analysis given in [1] has a crucial flaw, viz., the statement of Lemma 4.10 [1]...
متن کاملFully Dynamic Maximal Independent Set with Sublinear Update Time
A maximal independent set (MIS) can be maintained in an evolving m-edge graph by simply recomputing it from scratch in O(m) time after each update. But can it be maintained in time sublinear in m in fully dynamic graphs? We answer this fundamental open question in the affirmative. We present a deterministic algorithm with amortized update time O(min{∆,m3/4}), where ∆ is a fixed bound on the max...
متن کاملFully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time
We consider the problem of maintaining an approximately maximum (fractional) matching and an approximately minimum vertex cover in a dynamic graph. Starting with the seminal paper by Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. There remains, however, a polynomial gap between the best known worst case update time and the best known amortised u...
متن کاملDeterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solom...
متن کاملFully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds
Despite significant research effort, the state-of-the-art algorithm for maintaining an approximate matching in fully dynamic graphs has a polynomial worst-case update time, even for very poor approximation guarantees. In a recent breakthrough, Bhattacharya, Henzinger and Nanongkai showed how to maintain a constant approximation to the minimum vertex cover, and thus also a constant-factor estima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2015
ISSN: 0097-5397,1095-7111
DOI: 10.1137/130914140